5.2.1 Trace algorithms that perform a quicksort on linear arrays.
5.2.2 Construct algorithms that perform a quicksort on linear arrays.
5.2.3 Construct a hash table including the generation of addresses using modulo arithmetic and the handling of clashes by locating next free space.
5.2.4 Trace algorithms that implement a stack in an array.
5.2.5 Construct algorithms that implement a stack in an array. This includes: to initialize a stack, to test for an empty or a full stack,
to push a data item, to pop a data item and to display the top dataitem. All operations must protect against overflow and underflow.
5.2.6 Trace algorithms that implement a queue in an array. 2
5.2.7 Construct algorithms that implement a queue in an array.
5.2.2 Construct algorithms that perform a quicksort on linear arrays.
5.2.3 Construct a hash table including the generation of addresses using modulo arithmetic and the handling of clashes by locating next free space.
5.2.4 Trace algorithms that implement a stack in an array.
5.2.5 Construct algorithms that implement a stack in an array. This includes: to initialize a stack, to test for an empty or a full stack,
to push a data item, to pop a data item and to display the top dataitem. All operations must protect against overflow and underflow.
5.2.6 Trace algorithms that implement a queue in an array. 2
5.2.7 Construct algorithms that implement a queue in an array.